Sub-optimal polynomial meshes on planar Lipschitz domains
نویسندگان
چکیده
We construct norming meshes with cardinality O(ns), s = 3, for polynomials of total degree at most n, on the closure of bounded planar Lipschitz domains. Such cardinality is intermediate between optimality (s = 2), recently obtained by Kroó on multidimensional C starlike domains, and that arising from a general construction on Markov compact sets due to Calvi and Levenberg (s = 4). 2000 AMS subject classification: 41A10, 41A63, 65D05.
منابع مشابه
Computing optimal polynomial meshes on planar starlike domains
We construct polynomial norming meshes with optimal cardinality growth, on planar compact starlike domains that satisfy a uniform interior ball condition. Moreover, we provide an algorithm that computes such meshes on planar C convex domains by Blaschke’s rolling ball theorem. 2000 AMS subject classification: 41A10, 41A63, 65D05.
متن کاملConstructing optimal polynomial meshes on planar starlike domains
We construct polynomial norming meshes with optimal cardinality growth, on planar compact starlike domains that satisfy a Uniform Interior Ball Condition (UIBC). 2000 AMS subject classification: 41A10, 41A63, 65D05.
متن کاملPolynomial meshes on some classes of planar compact domains ∗
We construct low cardinality admissible meshes for polynomials on three classes of planar compact domains: cartesian graph domains, polar graph domains, and domains with piecewise C 2 boundary, that satisfy a Markov polynomial inequality. 1 Planar cartesian and polar graph domains Let K ⊂ R d be a polynomial determining compact domain (i.e., a polynomial vanishing there vanishes everywhere). We...
متن کاملOptimal polynomial admissible meshes on some classes of compact subsets of Rd
We show that any compact subset of Rd which is the closure of a bounded star-shaped Lipschitz domain Ω, such that {Ω has positive reach in the sense of Federer, admits an optimal AM (admissible mesh), that is a sequence of polynomial norming sets with optimal cardinality. This extends a recent result of A. Kroó on C 2 star-shaped domains. Moreover, we prove constructively the existence of an op...
متن کاملMaximum Norm Analysis of a Nonmatching Grids Method for Nonlinear Elliptic Boundary Value Problem −Δu = f(u)
We provide a maximum norm analysis of a finite element Schwarz alternating method for a nonlinear elliptic boundary value problem of the form −Δu = f(u), on two overlapping sub domains with non matching grids. We consider a domain which is the union of two overlapping sub domains where each sub domain has its own independently generated grid. The two meshes being mutually independent on the ove...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013